A new deterministic algorithm based cheating prevention scheme for Visual Cryptography

In 1995, Naor and Shamir proposed the k-out-of-n Visual Cryptography scheme such that only more than or equal to k participants can visually recover the secret through superimposing their transparencies. In 2006, Horng et al. indicated that cheating is possible when some participants create forged transparencies to deceive the remaining participants. In 2007, Tsai et al. proposed another cheating prevention scheme which was redesigned and extended by Generic Algorithms. This scheme was shown more secure in comparison with previous cheating prevention schemes in the literature. However, the major limitation of it is the case when the secret image consists of much more white pixels than black pixels, the secret shared by Generic Algorithms could be decoded incorrectly. In this paper, a new scheme is given to solve the cheating problem without extra burdens by adopting multiple distinct secret images and Generic Algorithms. Finally, experimental results and security analysis demonstrate the feasibility of the proposed scheme.